A General Parallel Tabu Search Algorithm For Combinatorial Optimisation Problems ?
نویسندگان
چکیده
Tabu Search (TS) is a meta-heuristic search algorithm that is easy to parallelise. E cient parallelisation of TS can represent a signi cant saving in the real-time required to solve a problem over an equivalent sequential algorithm. In this study, a general parallel TS algorithm for solving combinatorial optimisation problems (COPs) is presented. The unique feature of our approach is that the TS solves a wide range of COPs expressed in a high level syntax. The bene t of this general code is that it can be used in real-time applications due to its parallel scalability and the fact that it can accept changing problem de nitions. After reviewing a number of suitable parallelisation strategies, results are presented that show that good parallel speedup is achieved while e cient solutions to hard COPs are obtained.
منابع مشابه
Application Specific Computers for Combinatorial Optimisation
Solving large combinatorial optimisation problems is often time consuming, and thus there is interest in accelerating current algorithms by building application specific computers. This paper focuses on accelerating general local search meta-heuristics, such as simulated annealing and tabu search, and presents an architecture for this class of algorithms. As a design case study we describe a sp...
متن کاملAMultilevel Approach to the Graph Colouring Problem
Wemotivate, derive and implement a multilevel approach to the graph colouring problem. The resulting algorithm progressively coarsens the problem, initialises a colouring and then employs either Culberson’s iterated greedy algorithm or tabu search to refine the solution on each of the coarsened problems in reverse order. Tests on a large suite of problem instances indicate that for low-density ...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملAn Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery
The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...
متن کاملDeveloping a Permutation Method Using Tabu Search Algorithm: A Case Study of Ranking Some Countries of West Asia and North Africa Based on Important Development Criteria
The recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. One of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...
متن کامل